Wireless Sensor Network Localization Using Socp Relaxation

In recent year node localization is one of the most important issue since it plays a critical role in many situation. The aim of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pair wise noisy distance measurements and some anchor node positions using distributed localization algorithm based on second-order cone programming relaxation. The distributed sensor network localization algorithm using SOCP Relaxation is implemented and Simulation for uniform network topologies shows, the anchor position and distance estimation errors, and the performance gains achievable in terms of localization accuracy and computational efficiency.